Quasi-sparsest solutions for quantized compressed sensing by graduated-non-convexity based reweighted ℓ1 minimization
نویسندگان
چکیده
In this paper, we address the problem of sparse signal recovery from scalar quantized compressed sensing measurements, via optimization. To compensate for compression losses due to dimensionality reduction and quantization, we consider a cost function that is more sparsity-inducing than the commonly used `1-norm. Besides, we enforce a quantization consistency constraint that naturally handles the saturation issue. We investigate the potential of the recent GraduatedNon-Convexity based reweighted `1-norm minimization for sparse recovery over polyhedral sets. We demonstrate by simulations, the robustness of the proposed approach towards saturation and its significant performance gain, in terms of reconstruction accuracy and support recovery capability.
منابع مشابه
A Reweighted ℓ1-Minimization Based Compressed Sensing for the Spectral Estimation of Heart Rate Variability Using the Unevenly Sampled Data
In this paper, a reweighted ℓ1-minimization based Compressed Sensing (CS) algorithm incorporating the Integral Pulse Frequency Modulation (IPFM) model for spectral estimation of HRV is introduced. Knowing as a novel sensing/sampling paradigm, the theory of CS asserts certain signals that are considered sparse or compressible can be possibly reconstructed from substantially fewer measurements th...
متن کاملA Robust Reweighted L1-Minimization Imaging Algorithm for Passive Millimeter Wave SAIR in Near Field
The Compressive Sensing (CS) approach has proven to be useful for Synthetic Aperture Interferometric Radiometer (SAIR) imaging because it provides the same high-resolution capability while using part of interferometric observations compared to traditional methods using the entirety. However, it cannot always obtain the sparsest solution and may yield outliers with the non-adaptive random measur...
متن کاملA New Computational Method for the Sparsest Solutions to Systems of Linear Equations
The connection between the sparsest solution to an underdetermined system of linear equations and the weighted l1-minimization problem is established in this paper. We show that seeking the sparsest solution to a linear system can be transformed to searching for the densest slack variable of the dual problem of weighted l1-minimization with all possible choices of nonnegative weights. Motivated...
متن کاملA comparison of typical ℓp minimization algorithms
Recently, compressed sensing has been widely applied to various areas such as signal processing, machine learning, and pattern recognition. To find the sparse representation of a vector w.r.t. a dictionary, an l1 minimization problem, which is convex, is usually solved in order to overcome the computational difficulty. However, to guarantee that the l1 minimizer is close to the sparsest solutio...
متن کاملImproved sparse recovery thresholds with two-step reweighted ℓ1 minimization
It is well known that l1 minimization can be used to recover sufficiently sparse unknown signals from compressed linear measurements. In fact, exact thresholds on the sparsity, as a function of the ratio between the system dimensions, so that with high probability almost all sparse signals can be recovered from iid Gaussian measurements, have been computed and are referred to as “weak threshold...
متن کامل